Penalty Methods for the Solution of Discrete HJB Equations - Continuous Control and Obstacle Problems

نویسندگان

  • Jan Hendrik Witte
  • Christoph Reisinger
چکیده

In this paper, we present a novel penalty approach for the numerical solution of continuously controlled HJB equations and HJB obstacle problems. Our results include estimates of the penalization error for a class of penalty terms, and we show that variations of Newton’s method can be used to obtain globally convergent iterative solvers for the penalized equations. Furthermore, we discuss under what conditions local quadratic convergence of the iterative solvers can be expected. We include numerical results demonstrating the competitiveness of our methods.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Numerical Solution of Discretised HJB Equations with Applications in Finance

We consider the numerical solution of discretised Hamilton-Jacobi-Bellman (HJB) equations with applications in finance. For the discrete linear complementarity problem arising in American option pricing, we study a policy iteration method. We show, analytically and numerically, that, in standard situations, the computational cost of this approach is comparable to that of European option pricing...

متن کامل

A novel technique for a class of singular boundary value problems

In this paper, Lagrange interpolation in Chebyshev-Gauss-Lobatto nodes is used to develop a procedure for finding discrete and continuous approximate solutions of a singular boundary value problem. At first, a continuous time optimization problem related to the original singular boundary value problem is proposed. Then, using the Chebyshev- Gauss-Lobatto nodes, we convert the continuous time op...

متن کامل

Continuous Discrete Variable Optimization of Structures Using Approximation Methods

Optimum design of structures is achieved while the design variables are continuous and discrete. To reduce the computational work involved in the optimization process, all the functions that are expensive to evaluate, are approximated. To approximate these functions, a semi quadratic function is employed. Only the diagonal terms of the Hessian matrix are used and these elements are estimated fr...

متن کامل

Invariant functions for solving multiplicative discrete and continuous ordinary differential equations

In this paper, at first the elemantary and basic concepts of multiplicative discrete and continous differentian and integration introduced. Then for these kinds of differentiation invariant functions the general solution of discrete and continous multiplicative differential equations will be given. Finaly a vast class of difference equations with variable coefficients and nonlinear difference e...

متن کامل

A Penalty Method for Some Nonlinear Variational Obstacle Problems∗

We formulate a penalty method for the obstacle problem associated with a nonlinear variational principle. It is proven that the solution to the relaxed variational problem (in both the continuous and discrete settings) is exact for finite parameter values above some calculable quantity. To solve the relaxed variational problem, an accelerated forward-backward method is used, which ensures conve...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • SIAM J. Numerical Analysis

دوره 50  شماره 

صفحات  -

تاریخ انتشار 2012